New Steganographic Scheme Based Of Reed- Solomon Codes

How Reed-Solomon Codes Can Improve Steganographic Schemes

The use of syndrome coding in steganographic schemes tends to reduce distortion during embedding. The more complete model comes from the wet papers (J. Fridrich et al., 2005) and allow to lock positions which cannot be modified. Recently, binary BCH codes have been investigated and seem to be good candidates in this context (D. Schönfeld and A. Winkler, 2006). Here, we show that Reed-Solomon co...

Quantum Reed-Solomon Codes

During the last years it has been shown that computers taking advantage of quantum mechanical phenomena outperform currently used computers. The striking examples are integer factoring in polynomial time (see [8]) and finding pre– images of an n–ary Boolean function (“searching”) in time O( √ 2n) (see [5]). Quantum computers are not only of theoretical nature—there are several suggestions how t...

Parallel Reed-Solomon Codes

The compound and integrated parallel Reed-Solomon (RS) codes for multichannel communication systems are suggested. The matrix model of errors for such codes is investigated. Methods of coding and decoding of parallel RS codes, and also methods of increase of their error correcting capability are developed.

Reed-solomon Group Codes

Code Constructions based on Reed-Solomon Codes

Reed–Solomon codes are a well–studied code class which fulfill the Singleton bound with equality. However, their length is limited to the size q of the underlying field Fq. In this paper we present a code construction which yields codes with lengths of factors of the field size. Furthermore a decoding algorithm beyond half the minimum distance is given and analyzed.